All Questions
6 questions
5votes
1answer
273views
Hackerrank: Breaking the records
I'm learning Clojure and am a rank n00b at it, trying to learn from books and online tutorials (but I'm sometimes concerned that I am picking up bad habits or at least not all the good habits). For ...
- 153
7votes
2answers
1kviews
Letter Combinations of a phone number using a Dictionary
Problem statement (online source) Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone ...
- 103
15votes
3answers
3kviews
Project Euler Problem #8: Largest product in a series
The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832. ...
user85459
3votes
1answer
278views
Parsing n lines to count vowels - HackerEarth
I have written a haskell program for the following 'Code Monk' Challenge at HackerEarth. Here is the challenge description. Basically, we are looking for the number of vowels in a string. The first ...
5votes
3answers
5kviews
Using recursion to count substrings (with exceptions to the rule) in Java
I am going through the CodingBat exercises for Java. Here is the one I have just finished: Given a string, compute recursively the number of times lowercase hi ...
- 1,302
2votes
1answer
1kviews
Cutting stock recursion
This problem is identical to the one here: Suppose that you have been assigned the job of buying the plumbing pipes for a construction project. Your foreman gives you a list of the varying ...
- 123
